Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy

For an optimization problem known to be NP-Hard, the dichotomy study investigates reduction instances determine line separating polynomial-time solvable vs NP-Hard (easy hard instances). In this paper, we investigate well-studied Hamiltonian cycle (HCYCLE), and present interesting result on split graphs. T. Akiyama et al. (1980) have shown that HCYCLE is NP-complete planar bipartite graphs with maximum degree [Formula: see text]. We use show for text]-free Further, algorithms in believe structural results presented paper can used similar path other variants of (path) problems.